Unrelated parallel machine scheduling using local search
نویسندگان
چکیده
منابع مشابه
Iterated greedy local search methods for unrelated parallel machine scheduling
This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of ...
متن کاملA Local Search Heuristic for Unrelated Parallel Machine Scheduling with Efficient Neighborhood Search
The parallel mechine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the “efficiency” of the machinea for each job. It is shown that this method yields better solutions and shorter running times than the more general local search...
متن کاملSolving Parallel Machine Scheduling Problems with Variable Depth Local Search
We present new local search heuristics for the problem of scheduling jobs on identical parallel machines with the goal of minimizing total weighted completion time. Our proposed algorithm is a local search method based on combining a variable number of insertion moves. We develop an efficient heuristic for finding a profitable sequence of insertion moves. In a computational study, we compare th...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملHybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
We consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in order to minimize the makespan. We develop three heuristic approaches, i.e., a genetic algorithm, a tabu search algorithm and a hybridization of these heuristics with a truncated branch-and-bound procedure. This hybridization is made in order to accelerate the search process to near-optimal solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1994
ISSN: 0895-7177
DOI: 10.1016/0895-7177(94)90205-4